Implementation of Grover’s quantum search algorithm in a scalable system
نویسندگان
چکیده
We report the implementation of Grover’s quantum search algorithm in the scalable system of trapped atomic ion quantum bits. Any one of four possible states of a two-qubit memory is marked, and following a single query of the search space, the marked element is successfully recovered with an average probability of 60 2 %. This exceeds the performance of any possible classical search algorithm, which can only succeed with a maximum average probability of 50%.
منابع مشابه
Quantum Computing: A Distributed Approach
Quantum Computation literature, though bursting with interesting paradigms and problems, is still in its nascent phase and a careful focus is necessary on scaling the problem size so that an efficient physical realization is possible. In this work, we explore potential improvement in the run-time of quantum algorithms. Our proposed scheme of distributed quantum computing environment overcomes t...
متن کاملQuantum Computing for Solving a System of Nonlinear Equations over GF(q)
Grover’s quantum search algorithm is one of the most widely studied and has produced results in some search applications faster than their classical counterpart by a square-root. This paper modifies Grover’s algorithm to solve nonlinear equations over Galois Finite field GF(q) in O( mn 2 ) iteration, while the best classical general solution takes O(2) iteration. The modification is done by usi...
متن کاملShortening Grover’s Search Algorithm for an Expectation Value Quantum Computer
Quantum algorithms are conventionally formulated for implementation on a single system of qubits amenable to projective measurements. However, in expectation value quantum computation, such as nuclear magnetic resonance realizations, the computer consists of an ensemble of identical qubit-systems amenable only to expectation value measurements. The prevalent strategy in such expectation value i...
متن کاملCombining a local search and Grover’s algorithm in black-box global optimisation
Grover’s quantum algorithm promises a quadratic acceleration for any problem formulable as a search. For unstructured search problems, its implementation and performance are well understood. The curse of dimensionality and the intractibility of the general global optimisation problem require any identifiable structure or regularity to be incorporated into a solution method. This paper addresses...
متن کاملAn Intuitive Hamiltonian for Quantum Search
We present new intuition behind Grover’s quantum search algorithm by means of a Hamiltonian. Given a black-box Boolean function f : {0, 1}n → {0, 1} such that f(w) = 1 for exactly one w ∈ {0, 1}n, Grover [4] describes a quantum algorithm that finds w in O(2) time. Farhi & Gutmann [3] show that w can also be found in the same amount time by letting the quantum system evolve according to a simple...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005